Long-Tailed Jaeger Preys on Lesser Yellowlegs?

On the relevance of long-tailed durations

In this paper we obtain large deviation bounds for the queue length in a buffer fed by an M=G=1 process with G long-tailed, and in the limit that the arrival intensity grow to infinity along with the service rate so as to keep the offered load constant. This provides an example in which long-tailed arrival distributions are no bar to obtaining statistical multiplexing gain when such arrivals ar...

Visualizing bivariate long-tailed data

Variables in large data sets in biology or e-commerce often have a head, made up of very frequent values and a long tail of ever rarer values. Models such as the Zipf or Zipf–Mandelbrot provide a good description. The problem we address here is the visualization of two such long-tailed variables, as one might see in a bivariate Zipf context. We introduce a copula plot to display the joint behav...

Intelligent Worms: Searching for Preys

ABOUT THE AUTHORS. Zesheng Chen is currently a Ph.D. Candidate in the Communication Networks and Machine Learning Group at the School of Electrical and Computer Engineering, Georgia Institute of Technology, advised by Professor Chuanyi Ji. Chen’s research interests focus on network security, especially modeling the spread of malware on networks, the performance of distributed detection systems,...

A remark on the Petersen coloring conjecture of Jaeger

If G and H are two cubic graphs, then we write H ≺ G if G admits a proper edge-coloring f with edges of H, such that for each vertex x of G, there is a vertex y of H with f(∂G(x)) = ∂H(y). Let P and S be the Petersen graph and the Sylvester graph, respectively. In this paper, we introduce the Sylvester coloring conjecture. Moreover, we show that if G is a connected bridgeless cubic graph with G...

Predation by Ermine and Long-tailed Weasels on Duck Eggs